Variational density matrix optimization using semidefinite programming

نویسندگان

  • Brecht Verstichel
  • Helen van Aggelen
  • Dimitri Van Neck
  • Paul W. Ayers
  • Patrick Bultinck
چکیده

programming Brecht Verstichel, ∗ Helen van Aggelen, Dimitri Van Neck, Paul W. Ayers, and Patrick Bultinck Center for Molecular Modeling, Ghent University, Technologiepark 903, 9052 Zwijnaarde, Belgium Department of Inorganic and Physical Chemistry, Ghent University, Krijgslaan 281 (S3), 9000 Gent, Belgium Department of Chemistry, McMaster University, Hamilton, Ontario, L8S 4M1, Canada Abstract We discuss how semidefinite programming can be used to determine the second-order density matrix directly through a variational optimization. We show how the problem of characterizing a physical or N -representable density matrix leads to matrix-positivity constraints on the density matrix. We then formulate this in a standard semidefinite programming form, after which two interior point methods are discussed to solve the SDP. As an example we show the results of an application of the method on the isoelectronic series of Beryllium.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variational Two-electron Reduced Density Matrix Theory for Many-electron Atoms and Molecules: Implementation of the Spin- and Symmetry-adapted T2 Condition through First-order Semidefinite Programming

Abstract The energy and properties of a many-electron atom or molecule may be directly computed from a variational optimization of a two-electron reduced density matrix (2-RDM) that is constrained to represent many-electron quantum systems. In this paper we implement a variational 2-RDM method with a representability constraint, known as the T2 condition. The optimization of the 2-RDM is perfor...

متن کامل

Orthogonal Invariance and Identifiability

Matrix variables are ubiquitous in modern optimization, in part because variational properties of useful matrix functions often expedite standard optimization algorithms. Convexity is one important such property: permutation-invariant convex functions of the eigenvalues of a symmetric matrix are convex, leading to the wide applicability of semidefinite programming algorithms. We prove the analo...

متن کامل

A Direct Formulation for Sparse PCA Using Semidefinite Programming

Given a covariance matrix, we consider the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the number of nonzero coefficients in this combination. This problem arises in the decomposition of a covariance matrix into sparse factors or sparse PCA, and has wide applications ranging from biology to finance. We use a modificat...

متن کامل

Convex optimization problems involving finite autocorrelation sequences

We discuss convex optimization problems where some of the variables are constrained to be finite autocorrelation sequences. Problems of this form arise in signal processing and communications, and we describe applications in filter design and system identification. Autocorrelation constraints in optimization problems are often approximated by sampling the corresponding power spectral density, w...

متن کامل

A path following interior-point algorithm for semidefinite optimization problem based on new kernel function

In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Physics Communications

دوره 182  شماره 

صفحات  -

تاریخ انتشار 2011